Split-and-merge algorithms defined on topological maps for 3D image segmentation

نویسندگان

  • Guillaume Damiand
  • Patrick Resch
چکیده

Split-and-merge algorithms define a class of image segmentation methods. Topological maps are a mathematical model that represents image subdivisions in 2D and 3D. This paper discusses a split-and-merge method for 3D image data based on the topological map model. This model allows representations of states of segmentations and of merge and split operations. Indeed, it can be used as data structure for dynamic changes of segmentation. The paper details such an algorithmic approach and analyzes its time complexity. A general introduction into combinatorial and topological maps is given to support the understanding of the proposed algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Split and Merge Algorithm with Topological Maps

Usually, segmentation algorithms implementing the split and merge operations are restricted to a split stage followed by a merge stage. In this paper, we present a new split and merge algorithm combining alternatively split and merge operations at each recursive step. This algorithm is based on a data structure encoding topological maps in a discrete plane. The topogical maps of an image are de...

متن کامل

Topological Map Based Algorithms for 3D Image Segmentation

One of the most commonly used approach to segment a 2D image is the split and merge approach. In this paper, we are defining these two operations in 3D within the topological maps framework. This mathematic model of regions segmented image representation allows us to define these algorithms in a local and generic way. Moreover, we are defining a new operation, the corefining, which allows to tr...

متن کامل

Parallel 3D Split and Merge Segmentation with Oriented Boundary Graph

In this paper, we present how 3D split and merge segmentation using topological and geometrical structuring with an Oriented Boundary Graph may be optimized by parallel algorithms. This structuring allows to implement efficiently split and merge operations, but since these treatments have often to be applied with large images, we have studied how to improve performances by parallelizing this pr...

متن کامل

Topological Map: Minimal Encoding of 3d Segmented Images

In this paper we define formally and completely the 3d topological map introduced in [5]: a model which encodes totally and minimally all the topological information of a 3d image. In particular, we focus on the problem of disconnections induced by the constructive definition based on several levels of maps. This multilevel representation is more or less a graph pyramid in sense that each level...

متن کامل

Image Segmentation with Topological Maps and Inter-pixel Representation

In this paper we present a data structure improving region segmentation of 2D images. This data structure provides an eecient access to the set of pixel of one region. It also provides topological informations like the frontier of a region, the neighbours of a region or the set of regions included in one region. Thanks to this data structure diierent segmentation algorithms can be combined to p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphical Models

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2003